package Practice;

import java.util.Scanner;

public class Conjecture {
    public static boolean isPrime(int x){
        if (x < 2) return false;
        if (x == 2) return true;
        int x1 = (int) Math.sqrt(x);
        for (int i = 2; i <= x1; i++) {
            if (x%i==0)
                return false;
        }
        return true;
    }

    public static void num(int n){
        for (int i = 2; i <= n - 2; i++) {
            int j = n - i;
            if (isPrime(j)&&isPrime(i)){
                System.out.println(n+"="+i+"+"+j);
                break;
            }
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int h = (N - 2) / 2;
        for (int i = 1; i <= h; i++) {
            int m = 2*i + 2;
            num(m);
        }
        sc.close();
    }
}
